A Note on Partitions and Compositions Defined by Inequalities
نویسندگان
چکیده
for some positive integers b1, . . . , bn. Specifically, it was shown that if C is an upper triangular matrix with all ci,i = 1, and if B = C−1 has nonnegative entries, then FC(q) is given by (2), where bj is the sum of the entries in column j of B = [bi,j ]. Moreover, it was shown that this provides a natural bijection between the “partitions” of N into parts from the multiset {b1, . . . , bn} and the compositions of N in SC given by: b1 1 b m2 2 · · · bn n ↔ (λ1, λ2, . . . , λn), (3) ∗Research supported in part by NSF grants DMS-0300034 and INT-0230800
منابع مشابه
Partitions and Compositions Defined by Inequalities
We consider sequences of integers (λ1, . . . , λk) defined by a system of linear inequalities λi ≥ ∑ j>i aijλj with integer coefficients. We show that when the constraints are strong enough to guarantee that all λi are nonnegative, the generating function for the integer solutions of weight n has a finite product form ∏ i(1 − q i), where the bi are positive integers that can be computed from th...
متن کاملSome n-Color Compositions
In the classical theory of partitions, compositions were first defined by MacMahon [1] as ordered partitions. For example, there are 5 partitions and 8 compositions of 4. The partitions are 4, 31, 22, 21, 1 and the compositions are 4, 31, 13, 22, 21, 121, 12, 1. Agarwal and Andrews [2] defined an n-color partition as a partition in which a part of size n can come in n different colors. They den...
متن کاملCorrections to the results derived in "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions"'; and a comparison of four restricted integer composition generation algorithms
In this note, I discuss results on integer compositions/partitions given in the paper “A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions”. I also experiment with four different generation algorithms for restricted integer compositions and find the algorithm designed in the named paper to be pretty slow, comparatively. Some of my ...
متن کاملLinear optimization on the intersection of two fuzzy relational inequalities defined with Yager family of t-norms
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Yager family of t-norms is considered as fuzzy composition. Yager family of t-norms is a parametric family of continuous nilpotent t-norms which is also one of the most frequently appli...
متن کاملA note on inequalities for Tsallis relative operator entropy
In this short note, we present some inequalities for relative operator entropy which are generalizations of some results obtained by Zou [Operator inequalities associated with Tsallis relative operator entropy, {em Math. Inequal. Appl.} {18} (2015), no. 2, 401--406]. Meanwhile, we also show some new lower and upper bounds for relative operator entropy and Tsallis relative o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005